Two Levels TTL for Unstructured P2P Network using Adaptive Probabilistic Search

P2P netw orks are playing an important role in current scenario of unstructured networks. P2P netw ork supports various applications and taking the advantage over the centralize search system .Centralize search systems suffer from the problems of single point of failure, low availability, denial of service attacks. Searching of the required data is a vital issue in the P2P netw ork. Many methods have been implemented for searching in P2P netw ork such as Flooding, Random Walk, Expanding Ring or Iterative deepening, K-Walker Random Walk, Tw o Level K Walker Random Walk, etc. These methods are based on property of randomness in the network. Some of these generate large traff ic while others take long searching time. A probabilistic approach w ith Two Level K Walker Random Walk for searching has been implemented in this paper and comparative study has been done with other algorithms.